A Type-Theoretic Account of Neg-Raising Predicates in Tree Adjoining Grammars
نویسندگان
چکیده
Neg-Raising (NR) verbs form a class of verbs with a clausal complement that show the following behavior: when a negation syntactically attaches to the matrix predicate, it can semantically attach to the embedded predicate. This paper presents an account of NR predicates within Tree Adjoining Grammar (TAG). We propose a lexical semantic interpretation that heavily relies on a Montague-like semantics for TAG and on higher-order types.
منابع مشابه
PreRkTAG: Prediction of RNA Knotted Structures Using Tree Adjoining Grammars
Background: RNA molecules play many important regulatory, catalytic and structural <span style="font-variant: normal; font-style: norma...
متن کاملA scalar implicature-based approach to Neg-raising
In this paper, I give an analysis of neg-raising inferences as scalar implicatures. The main motivation for this account as opposed to a presupposition-based approach (Bartsch 1973 and Gajewski 2005, 2007) comes from the differences between presuppositions and neg-raising inferences, noticed by Gajewski (2005, 2007) and Homer (2012). In response to this issue, Gajewski (2007) argues that neg-ra...
متن کاملNeg-Raising and Polarity
The representation of Neg-Raising in the grammar is a matter of controversy. I provide evidence for representing Neg-Raising as a kind of presupposition associated with certain predicates by providing a detailed analysis of NPI-licensing in Neg-Raising contexts. Specific features of presupposition projection are used to explain the licensing of strict NPIs under Neg-Raising predicates. Discussi...
متن کاملTree-adjoining Grammars for Optimality Theory Syntax
This paper explores an optimality-theoretic approach to syntax based on Tree-Adjoining Grammars (TAG), where two separate optimizations are responsible for the construction of local pieces of tree structure (elementary trees) and the combination of these pieces of structure. The local optimization takes a non-recursive predicate-argument structure (PA-chunk) as an underlying representation and ...
متن کاملMulti-Component Tree Insertion Grammars
In this paper we introduce a new mildly context sensitive formalism called Multi-Component Tree Insertion Grammar. This formalism is a generalization of Tree Insertion Grammars in the same sense that Multi-Component Tree Adjoining Grammars is a generalization of Tree Adjoining Grammars. We show that this class of grammatical formalisms is equivalent to Multi-Component Tree Adjoining Grammars, a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013